Grey Level Visual Cryptography for General Access Structures
نویسنده
چکیده
Visual cryptography, first introduced by Naor and Shamir, allows a secret (black and white) image to be encoded and distributed to a set of participants such that certain predefined sets of participants may reconstruct the image without any computation. In 2000, Blundo, De Santis, and Naor introduced a model for grey-level visual cryptography which is a generalization of visual cryptography for general access structures. Grey-level visual cryptography extends this model to include grey-scale images. Decoding is done by the human visual system. In this thesis we survey known results of grey-level visual cryptography and visual cryptography for general access structures. We extend several visual cryptography constructions to grey-level visual cryptography, and derive new results on the minimum possible pixel expansion for all possible access structures on at most four participants.
منابع مشابه
On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملA Visual Cryptographic Technicque for Chromatic Images Using Multi-Pixel Encoding Method
Visual cryptography is a secret sharing method that uses human eyes to decrypt the secret. Most visual cryptographic methods utilize the technique of pixel expansion, which causes the size of the shares to be much larger than that of the secret image. This situation is more serious for grey-level and chromatic images. In this paper, we propose a multi-pixel encoding method for grey-level and ch...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملVisual cryptography for grey level images
Visual cryptography is a cryptographic paradigm introduced by Naor and Shamir [Lecture Notes in Comput. Sci., Vol. 950, Springer, Berlin, 1995, p. 1]. Some predefined set of participants can decode a secret message (a black and white image) without any knowledge of cryptography and without performing any cryptographic computation: Their visual system will decode the message. In this paper we de...
متن کامل